#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>

using namespace std;
const int N = 1e6 + 10;
int cnt, p[N];
bool st[N];
void get_prime()
{
    int n = 1e6 + 10;
    for (int i = 2; i <= n; i++)
    {
        if (!st[i])
            p[++cnt] = i;
        for (int j = 1; p[j] * i <= n; j++)
        {
            st[p[j] * i] = true;
            if (i % p[j] == 0)
                break;
        }
    }
}

void solve(int x)
{
    for (int i = 2; i <= cnt; i++)
    {
        if (!st[x - p[i]])
        {
            printf("%d = %d + %d\n" , x , p[i] , x - p[i]);
            break;
        }
    }
}
int main()
{
    get_prime();
    int x;
    while (cin >> x, x)
    {
        solve(x);
    }
    return 0;
}